Nuprl Lemma : R-self-interface-implies 0,22

A:Realizer. R-self-interface(A R-interface-compat(A;A
latex


Definitionst  T, True, Knd, Type, Prop, Rsends-knd(x1), if b t else f fi, let x = a in b(x), , true, x:AB(x), P  Q, x:AB(x), x:AB(x), P & Q, P  Q, b, s = t, Unit, left+right, A, b, Reffect-knd(x1), Reffect?(x1), Rsends?(x1), R-interface-compat(A;B), Realizer, R-self-interface(R), es realizer ind Rrframe compseq tag def, es realizer ind Rbframe compseq tag def, es realizer ind Raframe compseq tag def, es realizer ind Rpre compseq tag def, es realizer ind Rsends compseq tag def, es realizer ind Reffect compseq tag def, es realizer ind Rsframe compseq tag def, es realizer ind Rframe compseq tag def, es realizer ind Rinit compseq tag def, es realizer ind Rplus compseq tag def, es realizer ind Rnone compseq tag def, type List, Id, IdLnk, State(ds), xt(x), a:A fp B(a), DeclaredType(ds;x), rec(x.A(x)), Void, False, @loc: only members of L read x, @lock sends only on links in L, @lock writes only members of L, @loc precondition for a(v:T):P State(ds) v, sends knd(v:T) on l:tagged(g,State(ds),v):dt, @loc effect knd(v:T)  x := f State(ds) v , only events in L send on lnk with tag, @loc only events in L change x:T, @loc x initially v:T, left  right, , Rsends-T(x1), Rsends-dt(x1), Rsends-l(x1), lnk(k), tag(k), f(x)?z, a = b, isrcv(k)
Lemmasisrcv wf, not functionality wrt iff, assert-eq-lnk, eq lnk wf, lnk wf, Rnone wf, Rplus wf, Rinit wf, Rframe wf, Rsframe wf, Reffect wf, Rsends wf, Rpre wf, Raframe wf, Rbframe wf, Rrframe wf, unit wf, decl-type wf, fpf wf, decl-state wf, IdLnk wf, Id wf, Knd wf, true wf, false wf, R-self-interface wf, es realizer wf, Rsends? wf, iff transitivity, assert of bnot, Reffect? wf, bnot wf, not wf, assert wf, eqtt to assert, eqff to assert, btrue wf, bool wf

origin